MINLP Based Retrieval of Generalized Cases
Identifieur interne : 000176 ( LNCS/Analysis ); précédent : 000175; suivant : 000177MINLP Based Retrieval of Generalized Cases
Auteurs : Alexander Tartakovski [Allemagne] ; Martin Schaaf [Allemagne] ; Rainer Maximini [Allemagne] ; Ralph Bergmann (informaticien) [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2004.
Descripteurs français
- Pascal (Inist)
- Automatisation, Composant logiciel, Intelligence artificielle, Méthode optimisation, Optimisation, Problème non linéaire, Programmation mathématique, Programmation mixte, Programmation non linéaire, Programmation partiellement en nombres entiers, Raisonnement basé sur cas, Réponse temporelle, Similitude, Temps réponse.
- Wicri :
- topic : Automatisation, Intelligence artificielle.
English descriptors
- KwdEn :
Abstract
Abstract: The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design automation. This paper addresses the similarity assessment and retrieval problem for case bases consisting of traditional and generalized cases. While approaches presented earlier were restricted to continuous domains, this paper addresses generalized cases defined over mixed, continuous and discrete, domains. It extends the view on the similarity assessment as a nonlinear optimization problem (NLP) towards a mixed integer nonlinear optimization problem (MINLP), which is an actual research topic in mathematical optimization. This is an important step because most real world applications require mixed domains for the case description. Furthermore, we introduce two optimization-based retrieval methods that operate on a previously created index structure, which restricts the retrieval response time significantly.
Url:
DOI: 10.1007/978-3-540-28631-8_30
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001253
- to stream Istex, to step Curation: 001141
- to stream Istex, to step Checkpoint: 000940
- to stream Main, to step Merge: 001A61
- to stream PascalFrancis, to step Corpus: 000B34
- to stream PascalFrancis, to step Curation: 000369
- to stream PascalFrancis, to step Checkpoint: 000916
- to stream Main, to step Merge: 001B83
- to stream Main, to step Curation: 001870
- to stream Main, to step Exploration: 001870
- to stream LNCS, to step Extraction: 000176
Links to Exploration step
ISTEX:ADBD492C52484354649BDD1BFBB1A6419A585CFCLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">MINLP Based Retrieval of Generalized Cases</title><author><name sortKey="Tartakovski, Alexander" sort="Tartakovski, Alexander" uniqKey="Tartakovski A" first="Alexander" last="Tartakovski">Alexander Tartakovski</name></author><author><name sortKey="Schaaf, Martin" sort="Schaaf, Martin" uniqKey="Schaaf M" first="Martin" last="Schaaf">Martin Schaaf</name></author><author><name sortKey="Maximini, Rainer" sort="Maximini, Rainer" uniqKey="Maximini R" first="Rainer" last="Maximini">Rainer Maximini</name></author><author><name sortKey="Bergmann, Ralph" sort="Bergmann, Ralph" uniqKey="Bergmann R" first="Ralph" last="Bergmann">Ralph Bergmann (informaticien)</name><affiliation><country>Allemagne</country><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:ADBD492C52484354649BDD1BFBB1A6419A585CFC</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-28631-8_30</idno><idno type="url">https://api.istex.fr/document/ADBD492C52484354649BDD1BFBB1A6419A585CFC/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001253</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001253</idno><idno type="wicri:Area/Istex/Curation">001141</idno><idno type="wicri:Area/Istex/Checkpoint">000940</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000940</idno><idno type="wicri:doubleKey">0302-9743:2004:Tartakovski A:minlp:based:retrieval</idno><idno type="wicri:Area/Main/Merge">001A61</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:04-0492305</idno><idno type="wicri:Area/PascalFrancis/Corpus">000B34</idno><idno type="wicri:Area/PascalFrancis/Curation">000369</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000916</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000916</idno><idno type="wicri:doubleKey">0302-9743:2004:Tartakovski A:minlp:based:retrieval</idno><idno type="wicri:Area/Main/Merge">001B83</idno><idno type="wicri:Area/Main/Curation">001870</idno><idno type="wicri:Area/Main/Exploration">001870</idno><idno type="wicri:Area/LNCS/Extraction">000176</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">MINLP Based Retrieval of Generalized Cases</title><author><name sortKey="Tartakovski, Alexander" sort="Tartakovski, Alexander" uniqKey="Tartakovski A" first="Alexander" last="Tartakovski">Alexander Tartakovski</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Business Information Systems II, University of Trier, 54286, Trier</wicri:regionArea><orgName type="university">Université de Trèves</orgName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Schaaf, Martin" sort="Schaaf, Martin" uniqKey="Schaaf M" first="Martin" last="Schaaf">Martin Schaaf</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Institute for Mathematics and Applied Computer Science, Data and Knowledge Management Group, University of Hildesheim, 31113, Hildesheim</wicri:regionArea><wicri:noRegion>31113, Hildesheim</wicri:noRegion><wicri:noRegion>Hildesheim</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Maximini, Rainer" sort="Maximini, Rainer" uniqKey="Maximini R" first="Rainer" last="Maximini">Rainer Maximini</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Business Information Systems II, University of Trier, 54286, Trier</wicri:regionArea><orgName type="university">Université de Trèves</orgName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Bergmann, Ralph" sort="Bergmann, Ralph" uniqKey="Bergmann R" first="Ralph" last="Bergmann">Ralph Bergmann (informaticien)</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Business Information Systems II, University of Trier, 54286, Trier</wicri:regionArea><orgName type="university">Université de Trèves</orgName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2004</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">ADBD492C52484354649BDD1BFBB1A6419A585CFC</idno><idno type="DOI">10.1007/978-3-540-28631-8_30</idno><idno type="ChapterID">30</idno><idno type="ChapterID">Chap30</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Artificial intelligence</term><term>Automation</term><term>Case based reasoning</term><term>Mathematical programming</term><term>Mixed integer programming</term><term>Mixed programming</term><term>Non linear programming</term><term>Nonlinear problems</term><term>Optimization</term><term>Optimization method</term><term>Response time</term><term>Similarity</term><term>Software component</term><term>Time response</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Automatisation</term><term>Composant logiciel</term><term>Intelligence artificielle</term><term>Méthode optimisation</term><term>Optimisation</term><term>Problème non linéaire</term><term>Programmation mathématique</term><term>Programmation mixte</term><term>Programmation non linéaire</term><term>Programmation partiellement en nombres entiers</term><term>Raisonnement basé sur cas</term><term>Réponse temporelle</term><term>Similitude</term><term>Temps réponse</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Automatisation</term><term>Intelligence artificielle</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design automation. This paper addresses the similarity assessment and retrieval problem for case bases consisting of traditional and generalized cases. While approaches presented earlier were restricted to continuous domains, this paper addresses generalized cases defined over mixed, continuous and discrete, domains. It extends the view on the similarity assessment as a nonlinear optimization problem (NLP) towards a mixed integer nonlinear optimization problem (MINLP), which is an actual research topic in mathematical optimization. This is an important step because most real world applications require mixed domains for the case description. Furthermore, we introduce two optimization-based retrieval methods that operate on a previously created index structure, which restricts the retrieval response time significantly.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Trèves (Allemagne)</li></settlement><orgName><li>Université de Trèves</li></orgName></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Tartakovski, Alexander" sort="Tartakovski, Alexander" uniqKey="Tartakovski A" first="Alexander" last="Tartakovski">Alexander Tartakovski</name></region><name sortKey="Bergmann, Ralph" sort="Bergmann, Ralph" uniqKey="Bergmann R" first="Ralph" last="Bergmann">Ralph Bergmann (informaticien)</name><name sortKey="Bergmann, Ralph" sort="Bergmann, Ralph" uniqKey="Bergmann R" first="Ralph" last="Bergmann">Ralph Bergmann (informaticien)</name><name sortKey="Maximini, Rainer" sort="Maximini, Rainer" uniqKey="Maximini R" first="Rainer" last="Maximini">Rainer Maximini</name><name sortKey="Maximini, Rainer" sort="Maximini, Rainer" uniqKey="Maximini R" first="Rainer" last="Maximini">Rainer Maximini</name><name sortKey="Schaaf, Martin" sort="Schaaf, Martin" uniqKey="Schaaf M" first="Martin" last="Schaaf">Martin Schaaf</name><name sortKey="Schaaf, Martin" sort="Schaaf, Martin" uniqKey="Schaaf M" first="Martin" last="Schaaf">Martin Schaaf</name><name sortKey="Tartakovski, Alexander" sort="Tartakovski, Alexander" uniqKey="Tartakovski A" first="Alexander" last="Tartakovski">Alexander Tartakovski</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000176 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000176 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= LNCS
|étape= Analysis
|type= RBID
|clé= ISTEX:ADBD492C52484354649BDD1BFBB1A6419A585CFC
|texte= MINLP Based Retrieval of Generalized Cases
}}
| This area was generated with Dilib version V0.6.31. |  |